The Densest Subgraph Problem with a Convex/Concave Size Function
نویسندگان
چکیده
منابع مشابه
Densest Subgraphs THE DENSE K SUBGRAPH PROBLEM
Given a graph G = (V, E) and a parameter k, we consider the problem of finding a subset U ⊆ V of size k that maximizes the number of induced edges (DkS). We improve upon the previously best known approximation ratio for DkS, a ratio that has not seen any progress during the last decade. Specifically, we improve the approximation ratio from n to n. The improved ratio is obtained by studying a va...
متن کاملOn the densest k-subgraph problem
Given an n-vertex graph G and a parameter k, we are to nd a k-vertex subgraph with the maximum number of edges. This problem is N P-hard. We show that the problem remains N P-hard even when the maximum degree in G is three. When G contains a k-clique, we give an algorithm that for any > 0 nds a k-vertex subgraph with at least (1 ?) ? k 2 edges, in time n O((1+log n k)==). We study the applicabi...
متن کاملA Deterministic Approximation Algorithm for the Densest K-subgraph Problem
In the Densest k-Subgraph problem (DSP), we are given an undirected weighted graph G = (V, E) with n vertices (v1, ..., vn). We seek to find a subset of k vertices (k belonging to {1, ..., n}) which maximizes the number of edges which have their two endpoints in the subset. This problem is NP-hard even for bipartite graphs, and no polynomial-time algorithm with a fixed performance guarantee is ...
متن کاملThe densest k-subgraph problem on clique graphs
The Densest k-Subgraph (DkS) problem asks for a k-vertex subgraph of a given graph with the maximum number of edges. The problem is strongly NPhard, as a generalization of the well known Clique problem and we also know that it does not admit a Polynomial Time Approximation Scheme (PTAS). In this paper we focus on special cases of the problem, with respect to the class of the input graph. Especi...
متن کاملThe densest subgraph problem in sparse random graphs
We determine the asymptotic behavior of the maximum subgraph density of large random graphs with a prescribed degree sequence. The result applies in particular to the Erdős-Rényi model, where it settles a conjecture of Hajek (1990). Our proof consists in extending the notion of balanced loads from finite graphs to their local weak limits, using unimodularity. This is a new illustration of the o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2017
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-017-0400-7